________________________________________________________________

Run Header: Complete YList Version try 5: /small pw steps

Run start:        31.01.2010 12:20:02
Input Data from:  dataset169.txt
Iteration limit:  500
NI iter. limit:   200

# of Customers  :300
# of Locations  :20
Ex.Facilities   :3
Total budget    :25000
Terror. attacks :2

Penalty Weight : 0,5
Update Policy  : 4-3 of last 10
pw inc. step   : 0,005

Coverage Ratio :0,069
Average f[i]   :4750
Average g[i,j] :2072,54901960784
Total demand   :16660
________________________________________________________________

## ITERATION 0 #######################


> Neighbours evaluated; 69
> Selected Move:	2810	1	-1	10	5500


> New Y[]: 
	
	 2  3  4  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0    >new incumb.: 2810


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 1 #######################


> Neighbours evaluated; 84
> Selected Move:	3950	1	-1	13	12000


> New Y[]: 
	
	 2  3  4  0  0  0  0  0  0  0  1  0  0  1  0  0  0  0  0  0    >new incumb.: 3950


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 2 #######################


> Neighbours evaluated; 93
> Selected Move:	5050	1	-1	11	17500


> New Y[]: 
	
	 2  3  4  0  0  0  0  0  0  0  1  1  0  1  0  0  0  0  0  0    >new incumb.: 5050


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 3 #######################


> Neighbours evaluated; 99
> Selected Move:	6110	1	-1	15	22500


> New Y[]: 
	
	 2  3  4  0  0  0  0  0  0  0  1  1  0  1  0  1  0  0  0  0    >new incumb.: 6110


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 4 #######################


> Neighbours evaluated; 95
> Selected Move:	6080	3	10	16	21500


> New Y[]: 
	
	 2  3  4  0  0  0  0  0  0  0  0  1  0  1  0  1  1  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 5 #######################


> Neighbours evaluated; 90
> Selected Move:	6330	1	-1	6	26000


> New Y[]: 
	
	 2  3  4  0  0  0  1  0  0  0  0  1  0  1  0  1  1  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 6 #######################


> Neighbours evaluated; 50
> Selected Move:	6710	3	13	8	25000


> New Y[]: 
	
	 2  3  4  0  0  0  1  0  1  0  0  1  0  0  0  1  1  0  0  0    >new incumb.: 6710


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0 
 > pw :0,495

## ITERATION 7 #######################


> Neighbours evaluated; 74
> Selected Move:	6530	3	8	5	25000


> New Y[]: 
	
	 2  3  4  0  0  1  1  0  0  0  0  1  0  0  0  1  1  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0 
 > pw :0,49

## ITERATION 8 #######################


> Neighbours evaluated; 54
> Selected Move:	6475	3	5	4	25500


> New Y[]: 
	
	 2  3  4  0  1  0  1  0  0  0  0  1  0  0  0  1  1  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0 
 > pw :0,485

## ITERATION 9 #######################


> Neighbours evaluated; 63
> Selected Move:	6220	3	6	14	25000


> New Y[]: 
	
	 2  3  4  0  1  0  0  0  0  0  0  1  0  0  1  1  1  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0 
 > pw :0,48

## ITERATION 10 #######################


> Neighbours evaluated; 80
> Selected Move:	6210	3	4	8	24500


> New Y[]: 
	
	 2  3  4  0  0  0  0  0  1  0  0  1  0  0  1  1  1  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0 
 > pw :0,475

## ITERATION 11 #######################


> Neighbours evaluated; 88
> Selected Move:	6145	3	14	5	26000


> New Y[]: 
	
	 2  3  4  0  0  1  0  0  1  0  0  1  0  0  0  1  1  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,47

## ITERATION 12 #######################


> Neighbours evaluated; 70
> Selected Move:	6420	3	11	6	25000


> New Y[]: 
	
	 2  3  4  0  0  1  1  0  1  0  0  0  0  0  0  1  1  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0 
 > pw :0,465

## ITERATION 13 #######################


> Neighbours evaluated; 67
> Selected Move:	6308	3	15	11	25500


> New Y[]: 
	
	 2  3  4  0  0  1  1  0  1  0  0  1  0  0  0  0  1  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,46

## ITERATION 14 #######################


> Neighbours evaluated; 51
> Selected Move:	6530	3	5	12	25000


> New Y[]: 
	
	 2  3  4  0  0  0  1  0  1  0  0  1  1  0  0  0  1  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,455

## ITERATION 15 #######################


> Neighbours evaluated; 91
> Selected Move:	6230	3	8	5	25000


> New Y[]: 
	
	 2  3  4  0  0  1  1  0  0  0  0  1  1  0  0  0  1  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0 
 > pw :0,45

## ITERATION 16 #######################


> Neighbours evaluated; 70
> Selected Move:	6230	3	11	8	25000


> New Y[]: 
	
	 2  3  4  0  0  1  1  0  1  0  0  0  1  0  0  0  1  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,445

## ITERATION 17 #######################


> Neighbours evaluated; 90
> Selected Move:	6005	3	6	11	26000


> New Y[]: 
	
	 2  3  4  0  0  1  0  0  1  0  0  1  1  0  0  0  1  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,44

## ITERATION 18 #######################


> Neighbours evaluated; 90
> Selected Move:	6040	3	12	14	25000


> New Y[]: 
	
	 2  3  4  0  0  1  0  0  1  0  0  1  0  0  1  0  1  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,435

## ITERATION 19 #######################


> Neighbours evaluated; 99
> Selected Move:	6030	3	5	12	24500


> New Y[]: 
	
	 2  3  4  0  0  0  0  0  1  0  0  1  1  0  1  0  1  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,43

## ITERATION 20 #######################


> Neighbours evaluated; 111
> Selected Move:	5965	3	14	15	25500


> New Y[]: 
	
	 2  3  4  0  0  0  0  0  1  0  0  1  1  0  0  1  1  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,425

## ITERATION 21 #######################


> Neighbours evaluated; 104
> Selected Move:	5960	3	8	6	24500


> New Y[]: 
	
	 2  3  4  0  0  0  1  0  0  0  0  1  1  0  0  1  1  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0 
 > pw :0,42

## ITERATION 22 #######################


> Neighbours evaluated; 95
> Selected Move:	6210	3	15	4	25500


> New Y[]: 
	
	 2  3  4  0  1  0  1  0  0  0  0  1  1  0  0  0  1  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0 
 > pw :0,415

## ITERATION 23 #######################


> Neighbours evaluated; 86
> Selected Move:	6115	3	4	13	26000


> New Y[]: 
	
	 2  3  4  0  0  0  1  0  0  0  0  1  1  1  0  0  1  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,41

## ITERATION 24 #######################


> Neighbours evaluated; 80
> Selected Move:	5930	3	12	14	25000


> New Y[]: 
	
	 2  3  4  0  0  0  1  0  0  0  0  1  0  1  1  0  1  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,405

## ITERATION 25 #######################


> Neighbours evaluated; 99
> Selected Move:	6128	3	6	15	25500


> New Y[]: 
	
	 2  3  4  0  0  0  0  0  0  0  0  1  0  1  1  1  1  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,41

## ITERATION 26 #######################


> Neighbours evaluated; 80
> Selected Move:	6030	3	13	5	24500


> New Y[]: 
	
	 2  3  4  0  0  1  0  0  0  0  0  1  0  0  1  1  1  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0 
 > pw :0,415

## ITERATION 27 #######################


> Neighbours evaluated; 79
> Selected Move:	6030	3	11	8	24500


> New Y[]: 
	
	 2  3  4  0  0  1  0  0  1  0  0  0  0  0  1  1  1  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,41

## ITERATION 28 #######################


> Neighbours evaluated; 83
> Selected Move:	5930	3	8	4	25000


> New Y[]: 
	
	 2  3  4  0  1  1  0  0  0  0  0  0  0  0  1  1  1  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,405

## ITERATION 29 #######################


> Neighbours evaluated; 67
> Selected Move:	6228	3	14	6	25500


> New Y[]: 
	
	 2  3  4  0  1  1  1  0  0  0  0  0  0  0  0  1  1  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,41

## ITERATION 30 #######################


> Neighbours evaluated; 63
> Selected Move:	6120	3	4	13	26000


> New Y[]: 
	
	 2  3  4  0  0  1  1  0  0  0  0  0  0  1  0  1  1  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,415

## ITERATION 31 #######################


> Neighbours evaluated; 65
> Selected Move:	5920	3	5	14	24500


> New Y[]: 
	
	 2  3  4  0  0  0  1  0  0  0  0  0  0  1  1  1  1  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,42

## ITERATION 32 #######################


> Neighbours evaluated; 83
> Selected Move:	6098	3	1	11	26100


> New Y[]: 
	
	 2  0  4  0  0  0  1  0  0  0  0  3  0  1  1  1  1  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,425

## ITERATION 33 #######################


> Neighbours evaluated; 48
> Selected Move:	6398	3	13	8	25100


> New Y[]: 
	
	 2  0  4  0  0  0  1  0  1  0  0  3  0  0  1  1  1  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0 
 > pw :0,43

## ITERATION 34 #######################


> Neighbours evaluated; 77
> Selected Move:	6217	3	8	5	25100


> New Y[]: 
	
	 2  0  4  0  0  1  1  0  0  0  0  3  0  0  1  1  1  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0 
 > pw :0,435

## ITERATION 35 #######################


> Neighbours evaluated; 65
> Selected Move:	6189	3	5	4	25600


> New Y[]: 
	
	 2  0  4  0  1  0  1  0  0  0  0  3  0  0  1  1  1  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0 
 > pw :0,44

## ITERATION 36 #######################


> Neighbours evaluated; 52
> Selected Move:	6318	4	11	4	25300


> New Y[]: 
	
	 2  0  4  0  3  0  1  0  0  0  0  1  0  0  1  1  1  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0 
 > pw :0,445

## ITERATION 37 #######################


> Neighbours evaluated; 70
> Selected Move:	6293	3	4	13	25600


> New Y[]: 
	
	 2  0  4  0  0  0  1  0  0  0  0  1  0  3  1  1  1  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,45

## ITERATION 38 #######################


> Neighbours evaluated; 83
> Selected Move:	6170	3	13	8	25600


> New Y[]: 
	
	 2  0  4  0  0  0  1  0  3  0  0  1  0  0  1  1  1  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0 
 > pw :0,455

## ITERATION 39 #######################


> Neighbours evaluated; 66
> Selected Move:	6122	4	8	15	25700


> New Y[]: 
	
	 2  0  4  0  0  0  1  0  1  0  0  1  0  0  1  3  1  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0 
 > pw :0,46

## ITERATION 40 #######################


> Neighbours evaluated; 79
> Selected Move:	5938	3	8	5	25700


> New Y[]: 
	
	 2  0  4  0  0  1  1  0  0  0  0  1  0  0  1  3  1  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0 
 > pw :0,465

## ITERATION 41 #######################


> Neighbours evaluated; 65
> Selected Move:	5934	4	15	5	25700


> New Y[]: 
	
	 2  0  4  0  0  3  1  0  0  0  0  1  0  0  1  1  1  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0 
 > pw :0,47

## ITERATION 42 #######################


> Neighbours evaluated; 65
> Selected Move:	5965	3	5	17	25500


> New Y[]: 
	
	 2  0  4  0  0  0  1  0  0  0  0  1  0  0  1  1  1  3  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,475

## ITERATION 43 #######################


> Neighbours evaluated; 75
> Selected Move:	6040	3	14	8	27000


> New Y[]: 
	
	 2  0  4  0  0  0  1  0  1  0  0  1  0  0  0  1  1  3  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0 
 > pw :0,48

## ITERATION 44 #######################


> Neighbours evaluated; 65
> Selected Move:	6010	2	8	-1	21500


> New Y[]: 
	
	 2  0  4  0  0  0  1  0  0  0  0  1  0  0  0  1  1  3  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,485

## ITERATION 45 #######################


> Neighbours evaluated; 87
> Selected Move:	6070	3	11	13	22500


> New Y[]: 
	
	 2  0  4  0  0  0  1  0  0  0  0  0  0  1  0  1  1  3  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,49

## ITERATION 46 #######################


> Neighbours evaluated; 80
> Selected Move:	6070	4	17	6	25000


> New Y[]: 
	
	 2  0  4  0  0  0  3  0  0  0  0  0  0  1  0  1  1  1  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,495

## ITERATION 47 #######################


> Neighbours evaluated; 55
> Selected Move:	6070	4	6	13	22600


> New Y[]: 
	
	 2  0  4  0  0  0  1  0  0  0  0  0  0  3  0  1  1  1  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 48 #######################


> Neighbours evaluated; 79
> Selected Move:	6070	4	13	15	23700


> New Y[]: 
	
	 2  0  4  0  0  0  1  0  0  0  0  0  0  1  0  3  1  1  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,505

## ITERATION 49 #######################


> Neighbours evaluated; 66
> Selected Move:	6070	4	15	16	24800


> New Y[]: 
	
	 2  0  4  0  0  0  1  0  0  0  0  0  0  1  0  1  3  1  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 50 #######################


> Neighbours evaluated; 80
> Selected Move:	6010	3	13	11	23800


> New Y[]: 
	
	 2  0  4  0  0  0  1  0  0  0  0  1  0  0  0  1  3  1  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,495

## ITERATION 51 #######################


> Neighbours evaluated; 67
> Selected Move:	6010	4	16	6	24000


> New Y[]: 
	
	 2  0  4  0  0  0  3  0  0  0  0  1  0  0  0  1  1  1  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,49

## ITERATION 52 #######################


> Neighbours evaluated; 64
> Selected Move:	6010	4	6	11	22100


> New Y[]: 
	
	 2  0  4  0  0  0  1  0  0  0  0  3  0  0  0  1  1  1  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,485

## ITERATION 53 #######################


> Neighbours evaluated; 85
> Selected Move:	6010	4	11	15	22700


> New Y[]: 
	
	 2  0  4  0  0  0  1  0  0  0  0  1  0  0  0  3  1  1  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,48

## ITERATION 54 #######################


> Neighbours evaluated; 86
> Selected Move:	6010	3	15	8	23100


> New Y[]: 
	
	 2  0  4  0  0  0  1  0  3  0  0  1  0  0  0  0  1  1  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,475

## ITERATION 55 #######################


> Neighbours evaluated; 78
> Selected Move:	6010	4	8	6	24500


> New Y[]: 
	
	 2  0  4  0  0  0  3  0  1  0  0  1  0  0  0  0  1  1  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,47

## ITERATION 56 #######################


> Neighbours evaluated; 62
> Selected Move:	6010	4	6	11	22600


> New Y[]: 
	
	 2  0  4  0  0  0  1  0  1  0  0  3  0  0  0  0  1  1  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,465

## ITERATION 57 #######################


> Neighbours evaluated; 83
> Selected Move:	6010	4	11	16	24300


> New Y[]: 
	
	 2  0  4  0  0  0  1  0  1  0  0  1  0  0  0  0  3  1  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,46

## ITERATION 58 #######################


> Neighbours evaluated; 61
> Selected Move:	6010	4	16	17	22000


> New Y[]: 
	
	 2  0  4  0  0  0  1  0  1  0  0  1  0  0  0  0  1  3  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,455

## ITERATION 59 #######################


> Neighbours evaluated; 89
> Selected Move:	6010	3	8	13	23000


> New Y[]: 
	
	 2  0  4  0  0  0  1  0  0  0  0  1  0  1  0  0  1  3  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,45

## ITERATION 60 #######################


> Neighbours evaluated; 81
> Selected Move:	6010	4	17	11	23600


> New Y[]: 
	
	 2  0  4  0  0  0  1  0  0  0  0  3  0  1  0  0  1  1  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,445

## ITERATION 61 #######################


> Neighbours evaluated; 71
> Selected Move:	6010	4	11	13	23100


> New Y[]: 
	
	 2  0  4  0  0  0  1  0  0  0  0  1  0  3  0  0  1  1  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,44

## ITERATION 62 #######################


> Neighbours evaluated; 86
> Selected Move:	5970	3	16	15	23600


> New Y[]: 
	
	 2  0  4  0  0  0  1  0  0  0  0  1  0  3  0  1  0  1  0  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,435

## ITERATION 63 #######################


> Neighbours evaluated; 75
> Selected Move:	6000	3	11	10	23600


> New Y[]: 
	
	 2  0  4  0  0  0  1  0  0  0  1  0  0  3  0  1  0  1  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,43

## ITERATION 64 #######################


> Neighbours evaluated; 75
> Selected Move:	6000	4	13	10	24500


> New Y[]: 
	
	 2  0  4  0  0  0  1  0  0  0  3  0  0  1  0  1  0  1  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,425

## ITERATION 65 #######################


> Neighbours evaluated; 67
> Selected Move:	6000	4	10	15	24700


> New Y[]: 
	
	 2  0  4  0  0  0  1  0  0  0  1  0  0  1  0  3  0  1  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,42

## ITERATION 66 #######################


> Neighbours evaluated; 62
> Selected Move:	6000	4	15	17	23500


> New Y[]: 
	
	 2  0  4  0  0  0  1  0  0  0  1  0  0  1  0  1  0  3  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,415

## ITERATION 67 #######################


> Neighbours evaluated; 86
> Selected Move:	5970	3	10	11	23500


> New Y[]: 
	
	 2  0  4  0  0  0  1  0  0  0  0  1  0  1  0  1  0  3  0  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,41

## ITERATION 68 #######################


> Neighbours evaluated; 78
> Selected Move:	5970	4	17	11	24100


> New Y[]: 
	
	 2  0  4  0  0  0  1  0  0  0  0  3  0  1  0  1  0  1  0  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,405

## ITERATION 69 #######################


> Neighbours evaluated; 72
> Selected Move:	5970	4	11	15	24700


> New Y[]: 
	
	 2  0  4  0  0  0  1  0  0  0  0  1  0  1  0  3  0  1  0  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,4

## ITERATION 70 #######################


> Neighbours evaluated; 70
> Selected Move:	5960	3	17	16	22700


> New Y[]: 
	
	 2  0  4  0  0  0  1  0  0  0  0  1  0  1  0  3  1  0  0  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,395

## ITERATION 71 #######################


> Neighbours evaluated; 90
> Selected Move:	5960	4	15	6	24000


> New Y[]: 
	
	 2  0  4  0  0  0  3  0  0  0  0  1  0  1  0  1  1  0  0  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,39

## ITERATION 72 #######################


> Neighbours evaluated; 76
> Selected Move:	5960	4	6	11	22100


> New Y[]: 
	
	 2  0  4  0  0  0  1  0  0  0  0  3  0  1  0  1  1  0  0  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,385

## ITERATION 73 #######################


> Neighbours evaluated; 88
> Selected Move:	5960	4	11	13	21600


> New Y[]: 
	
	 2  0  4  0  0  0  1  0  0  0  0  1  0  3  0  1  1  0  0  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,38

## ITERATION 74 #######################


> Neighbours evaluated; 87
> Selected Move:	5960	4	13	16	23800


> New Y[]: 
	
	 2  0  4  0  0  0  1  0  0  0  0  1  0  1  0  1  3  0  0  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,375

## ITERATION 75 #######################


> Neighbours evaluated; 94
> Selected Move:	5898	3	15	17	25300


> New Y[]: 
	
	 2  0  4  0  0  0  1  0  0  0  0  1  0  1  0  0  3  1  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,37

## ITERATION 76 #######################


> Neighbours evaluated; 57
> Selected Move:	5940	3	16	10	25000


> New Y[]: 
	
	 2  0  4  0  0  0  1  0  0  0  3  1  0  1  0  0  0  1  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,365

## ITERATION 77 #######################


> Neighbours evaluated; 66
> Selected Move:	5940	4	10	11	24600


> New Y[]: 
	
	 2  0  4  0  0  0  1  0  0  0  1  3  0  1  0  0  0  1  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,36

## ITERATION 78 #######################


> Neighbours evaluated; 68
> Selected Move:	5940	4	11	13	24100


> New Y[]: 
	
	 2  0  4  0  0  0  1  0  0  0  1  1  0  3  0  0  0  1  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,355

## ITERATION 79 #######################


> Neighbours evaluated; 76
> Selected Move:	5940	4	13	17	24000


> New Y[]: 
	
	 2  0  4  0  0  0  1  0  0  0  1  1  0  1  0  0  0  3  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,35

## ITERATION 80 #######################


> Neighbours evaluated; 93
> Selected Move:	5940	3	13	8	23000


> New Y[]: 
	
	 2  0  4  0  0  0  1  0  1  0  1  1  0  0  0  0  0  3  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,345

## ITERATION 81 #######################


> Neighbours evaluated; 98
> Selected Move:	5950	3	11	15	22500


> New Y[]: 
	
	 2  0  4  0  0  0  1  0  1  0  1  0  0  0  0  1  0  3  0  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,34

## ITERATION 82 #######################


> Neighbours evaluated; 94
> Selected Move:	5960	3	10	16	21500


> New Y[]: 
	
	 2  0  4  0  0  0  1  0  1  0  0  0  0  0  0  1  1  3  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0 
 > pw :0,335

## ITERATION 83 #######################


> Neighbours evaluated; 87
> Selected Move:	6090	1	-1	5	27000


> New Y[]: 
	
	 2  0  4  0  0  1  1  0  1  0  0  0  0  0  0  1  1  3  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0 
 > pw :0,33

## ITERATION 84 #######################


> Neighbours evaluated; 70
> Selected Move:	6150	3	8	11	27000


> New Y[]: 
	
	 2  0  4  0  0  1  1  0  0  0  0  1  0  0  0  1  1  3  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,325

## ITERATION 85 #######################


> Neighbours evaluated; 71
> Selected Move:	6188	3	5	4	27500


> New Y[]: 
	
	 2  0  4  0  1  0  1  0  0  0  0  1  0  0  0  1  1  3  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,32

## ITERATION 86 #######################


> Neighbours evaluated; 71
> Selected Move:	6140	3	4	13	28000


> New Y[]: 
	
	 2  0  4  0  0  0  1  0  0  0  0  1  0  1  0  1  1  3  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,315

## ITERATION 87 #######################


> Neighbours evaluated; 66
> Selected Move:	6124	4	17	13	28100


> New Y[]: 
	
	 2  0  4  0  0  0  1  0  0  0  0  1  0  3  0  1  1  1  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,32

## ITERATION 88 #######################


> Neighbours evaluated; 72
> Selected Move:	6104	3	13	4	27800


> New Y[]: 
	
	 2  0  4  0  3  0  1  0  0  0  0  1  0  0  0  1  1  1  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,325

## ITERATION 89 #######################


> Neighbours evaluated; 72
> Selected Move:	6015	3	17	5	26800


> New Y[]: 
	
	 2  0  4  0  3  1  1  0  0  0  0  1  0  0  0  1  1  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,33

## ITERATION 90 #######################


> Neighbours evaluated; 72
> Selected Move:	6061	3	11	14	25300


> New Y[]: 
	
	 2  0  4  0  3  1  1  0  0  0  0  0  0  0  1  1  1  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,335

## ITERATION 91 #######################


> Neighbours evaluated; 79
> Selected Move:	6059	3	4	13	25600


> New Y[]: 
	
	 2  0  4  0  0  1  1  0  0  0  0  0  0  3  1  1  1  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,34

## ITERATION 92 #######################


> Neighbours evaluated; 84
> Selected Move:	6036	3	14	11	27100


> New Y[]: 
	
	 2  0  4  0  0  1  1  0  0  0  0  1  0  3  0  1  1  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,345

## ITERATION 93 #######################


> Neighbours evaluated; 72
> Selected Move:	5958	3	16	14	26600


> New Y[]: 
	
	 2  0  4  0  0  1  1  0  0  0  0  1  0  3  1  1  0  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,35

## ITERATION 94 #######################


> Neighbours evaluated; 80
> Selected Move:	5950	3	5	9	26600


> New Y[]: 
	
	 2  0  4  0  0  0  1  0  0  1  0  1  0  3  1  1  0  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,355

## ITERATION 95 #######################


> Neighbours evaluated; 86
> Selected Move:	5939	3	13	4	26300


> New Y[]: 
	
	 2  0  4  0  3  0  1  0  0  1  0  1  0  0  1  1  0  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0 
 > pw :0,36

## ITERATION 96 #######################


> Neighbours evaluated; 83
> Selected Move:	5932	3	9	5	26300


> New Y[]: 
	
	 2  0  4  0  3  1  1  0  0  0  0  1  0  0  1  1  0  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0 
 > pw :0,365

## ITERATION 97 #######################


> Neighbours evaluated; 72
> Selected Move:	5906	3	5	10	26300


> New Y[]: 
	
	 2  0  4  0  3  0  1  0  0  0  1  1  0  0  1  1  0  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0 
 > pw :0,37

## ITERATION 98 #######################


> Neighbours evaluated; 83
> Selected Move:	5898	3	4	13	26600


> New Y[]: 
	
	 2  0  4  0  0  0  1  0  0  0  1  1  0  3  1  1  0  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,375

## ITERATION 99 #######################


> Neighbours evaluated; 88
> Selected Move:	5890	2	14	-1	22600


> New Y[]: 
	
	 2  0  4  0  0  0  1  0  0  0  1  1  0  3  0  1  0  0  0  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,38

## ITERATION 100 #######################


> Neighbours evaluated; 95
> Selected Move:	5940	3	13	17	22500


> New Y[]: 
	
	 2  0  4  0  0  0  1  0  0  0  1  1  0  0  0  1  0  3  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,385

## ITERATION 101 #######################


> Neighbours evaluated; 88
> Selected Move:	5940	4	17	6	25000


> New Y[]: 
	
	 2  0  4  0  0  0  3  0  0  0  1  1  0  0  0  1  0  1  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,39

## ITERATION 102 #######################


> Neighbours evaluated; 65
> Selected Move:	5950	3	11	8	25000


> New Y[]: 
	
	 2  0  4  0  0  0  3  0  1  0  1  0  0  0  0  1  0  1  0  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,395

## ITERATION 103 #######################


> Neighbours evaluated; 66
> Selected Move:	5960	3	10	16	24000


> New Y[]: 
	
	 2  0  4  0  0  0  3  0  1  0  0  0  0  0  0  1  1  1  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0 
 > pw :0,4

## ITERATION 104 #######################


> Neighbours evaluated; 66
> Selected Move:	5970	3	8	4	24500


> New Y[]: 
	
	 2  0  4  0  1  0  3  0  0  0  0  0  0  0  0  1  1  1  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,395

## ITERATION 105 #######################


> Neighbours evaluated; 63
> Selected Move:	5970	4	6	4	22300


> New Y[]: 
	
	 2  0  4  0  3  0  1  0  0  0  0  0  0  0  0  1  1  1  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,39

## ITERATION 106 #######################


> Neighbours evaluated; 86
> Selected Move:	5970	4	4	15	23200


> New Y[]: 
	
	 2  0  4  0  1  0  1  0  0  0  0  0  0  0  0  3  1  1  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,385

## ITERATION 107 #######################


> Neighbours evaluated; 77
> Selected Move:	5970	4	15	16	24300


> New Y[]: 
	
	 2  0  4  0  1  0  1  0  0  0  0  0  0  0  0  1  3  1  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,38

## ITERATION 108 #######################


> Neighbours evaluated; 60
> Selected Move:	5970	4	16	17	22000


> New Y[]: 
	
	 2  0  4  0  1  0  1  0  0  0  0  0  0  0  0  1  1  3  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,375

## ITERATION 109 #######################


> Neighbours evaluated; 94
> Selected Move:	5910	3	15	11	22500


> New Y[]: 
	
	 2  0  4  0  1  0  1  0  0  0  0  1  0  0  0  0  1  3  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0 
 > pw :0,37

## ITERATION 110 #######################


> Neighbours evaluated; 87
> Selected Move:	5910	4	17	4	22800


> New Y[]: 
	
	 2  0  4  0  3  0  1  0  0  0  0  1  0  0  0  0  1  1  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0 
 > pw :0,365

## ITERATION 111 #######################


> Neighbours evaluated; 86
> Selected Move:	5910	4	4	6	25000


> New Y[]: 
	
	 2  0  4  0  1  0  3  0  0  0  0  1  0  0  0  0  1  1  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0 
 > pw :0,36

## ITERATION 112 #######################


> Neighbours evaluated; 60
> Selected Move:	5910	4	6	11	23100


> New Y[]: 
	
	 2  0  4  0  1  0  1  0  0  0  0  3  0  0  0  0  1  1  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0 
 > pw :0,355

## ITERATION 113 #######################


> Neighbours evaluated; 80
> Selected Move:	5910	4	11	16	24800


> New Y[]: 
	
	 2  0  4  0  1  0  1  0  0  0  0  1  0  0  0  0  3  1  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0 
 > pw :0,35

## ITERATION 114 #######################


> Neighbours evaluated; 83
> Selected Move:	5900	3	16	10	24500


> New Y[]: 
	
	 2  0  4  0  1  0  1  0  0  0  3  1  0  0  0  0  0  1  0  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,345

## ITERATION 115 #######################


> Neighbours evaluated; 71
> Selected Move:	5940	3	4	8	24000


> New Y[]: 
	
	 2  0  4  0  0  0  1  0  1  0  3  1  0  0  0  0  0  1  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,34

## ITERATION 116 #######################


> Neighbours evaluated; 82
> Selected Move:	5950	3	11	15	23500


> New Y[]: 
	
	 2  0  4  0  0  0  1  0  1  0  3  0  0  0  0  1  0  1  0  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,335

## ITERATION 117 #######################


> Neighbours evaluated; 81
> Selected Move:	5960	3	10	16	23800


> New Y[]: 
	
	 2  0  4  0  0  0  1  0  1  0  0  0  0  0  0  1  3  1  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0 
 > pw :0,33

## ITERATION 118 #######################


> Neighbours evaluated; 73
> Selected Move:	5960	4	16	8	22600


> New Y[]: 
	
	 2  0  4  0  0  0  1  0  3  0  0  0  0  0  0  1  1  1  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0 
 > pw :0,325

## ITERATION 119 #######################


> Neighbours evaluated; 85
> Selected Move:	5983	1	-1	11	28100


> New Y[]: 
	
	 2  0  4  0  0  0  1  0  3  0  0  1  0  0  0  1  1  1  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0 
 > pw :0,32

## ITERATION 120 #######################


> Neighbours evaluated; 57
> Selected Move:	6158	4	8	11	27600


> New Y[]: 
	
	 2  0  4  0  0  0  1  0  1  0  0  3  0  0  0  1  1  1  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0 
 > pw :0,315

## ITERATION 121 #######################


> Neighbours evaluated; 74
> Selected Move:	6116	3	17	5	26600


> New Y[]: 
	
	 2  0  4  0  0  1  1  0  1  0  0  3  0  0  0  1  1  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,31

## ITERATION 122 #######################


> Neighbours evaluated; 84
> Selected Move:	6084	3	15	14	25600


> New Y[]: 
	
	 2  0  4  0  0  1  1  0  1  0  0  3  0  0  1  0  1  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,305

## ITERATION 123 #######################


> Neighbours evaluated; 83
> Selected Move:	6230	3	5	12	25100


> New Y[]: 
	
	 2  0  4  0  0  0  1  0  1  0  0  3  1  0  1  0  1  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,31

## ITERATION 124 #######################


> Neighbours evaluated; 100
> Selected Move:	6074	4	11	8	25600


> New Y[]: 
	
	 2  0  4  0  0  0  1  0  3  0  0  1  1  0  1  0  1  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,315

## ITERATION 125 #######################


> Neighbours evaluated; 101
> Selected Move:	6071	3	8	13	25600


> New Y[]: 
	
	 2  0  4  0  0  0  1  0  0  0  0  1  1  3  1  0  1  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,32

## ITERATION 126 #######################


> Neighbours evaluated; 97
> Selected Move:	6054	3	13	4	25300


> New Y[]: 
	
	 2  0  4  0  3  0  1  0  0  0  0  1  1  0  1  0  1  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0 
 > pw :0,325

## ITERATION 127 #######################


> Neighbours evaluated; 98
> Selected Move:	5955	4	4	11	25600


> New Y[]: 
	
	 2  0  4  0  1  0  1  0  0  0  0  3  1  0  1  0  1  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0 
 > pw :0,33

## ITERATION 128 #######################


> Neighbours evaluated; 103
> Selected Move:	5927	3	4	5	25100


> New Y[]: 
	
	 2  0  4  0  0  1  1  0  0  0  0  3  1  0  1  0  1  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0 
 > pw :0,335

## ITERATION 129 #######################


> Neighbours evaluated; 94
> Selected Move:	5914	3	14	8	26600


> New Y[]: 
	
	 2  0  4  0  0  1  1  0  1  0  0  3  1  0  0  0  1  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,34

## ITERATION 130 #######################


> Neighbours evaluated; 82
> Selected Move:	5916	3	5	17	27600


> New Y[]: 
	
	 2  0  4  0  0  0  1  0  1  0  0  3  1  0  0  0  1  1  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,345

## ITERATION 131 #######################


> Neighbours evaluated; 60
> Selected Move:	6110	4	11	17	27000


> New Y[]: 
	
	 2  0  4  0  0  0  1  0  1  0  0  1  1  0  0  0  1  3  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,35

## ITERATION 132 #######################


> Neighbours evaluated; 83
> Selected Move:	5935	3	12	5	27500


> New Y[]: 
	
	 2  0  4  0  0  1  1  0  1  0  0  1  0  0  0  0  1  3  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,355

## ITERATION 133 #######################


> Neighbours evaluated; 70
> Selected Move:	5860	3	11	12	27000


> New Y[]: 
	
	 2  0  4  0  0  1  1  0  1  0  0  0  1  0  0  0  1  3  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,36

## ITERATION 134 #######################


> Neighbours evaluated; 73
> Selected Move:	5790	3	8	11	27000


> New Y[]: 
	
	 2  0  4  0  0  1  1  0  0  0  0  1  1  0  0  0  1  3  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0 
 > pw :0,365

## ITERATION 135 #######################


> Neighbours evaluated; 68
> Selected Move:	5788	3	5	4	27500


> New Y[]: 
	
	 2  0  4  0  1  0  1  0  0  0  0  1  1  0  0  0  1  3  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0 
 > pw :0,37

## ITERATION 136 #######################


> Neighbours evaluated; 71
> Selected Move:	5765	3	4	14	25500


> New Y[]: 
	
	 2  0  4  0  0  0  1  0  0  0  0  1  1  0  1  0  1  3  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,375

## ITERATION 137 #######################


> Neighbours evaluated; 76
> Selected Move:	5825	3	12	8	26000


> New Y[]: 
	
	 2  0  4  0  0  0  1  0  1  0  0  1  0  0  1  0  1  3  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,38

## ITERATION 138 #######################


> Neighbours evaluated; 69
> Selected Move:	6010	3	11	15	25500


> New Y[]: 
	
	 2  0  4  0  0  0  1  0  1  0  0  0  0  0  1  1  1  3  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,385

## ITERATION 139 #######################


> Neighbours evaluated; 82
> Selected Move:	6001	3	17	7	25700


> New Y[]: 
	
	 2  0  4  0  0  0  1  3  1  0  0  0  0  0  1  1  1  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,39

## ITERATION 140 #######################


> Neighbours evaluated; 84
> Selected Move:	5927	3	7	5	25700


> New Y[]: 
	
	 2  0  4  0  0  3  1  0  1  0  0  0  0  0  1  1  1  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,395

## ITERATION 141 #######################


> Neighbours evaluated; 61
> Selected Move:	5963	4	5	8	25600


> New Y[]: 
	
	 2  0  4  0  0  1  1  0  3  0  0  0  0  0  1  1  1  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,4

## ITERATION 142 #######################


> Neighbours evaluated; 65
> Selected Move:	5920	4	8	15	25700


> New Y[]: 
	
	 2  0  4  0  0  1  1  0  1  0  0  0  0  0  1  3  1  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,405

## ITERATION 143 #######################


> Neighbours evaluated; 77
> Selected Move:	5729	3	14	11	27200


> New Y[]: 
	
	 2  0  4  0  0  1  1  0  1  0  0  1  0  0  0  3  1  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,41

## ITERATION 144 #######################


> Neighbours evaluated; 66
> Selected Move:	5830	2	5	-1	21700


> New Y[]: 
	
	 2  0  4  0  0  0  1  0  1  0  0  1  0  0  0  3  1  0  0  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,415

## ITERATION 145 #######################


> Neighbours evaluated; 93
> Selected Move:	5960	3	11	17	22700


> New Y[]: 
	
	 2  0  4  0  0  0  1  0  1  0  0  0  0  0  0  3  1  1  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0 
 > pw :0,42

## ITERATION 146 #######################


> Neighbours evaluated; 90
> Selected Move:	5950	3	16	10	23700


> New Y[]: 
	
	 2  0  4  0  0  0  1  0  1  0  1  0  0  0  0  3  0  1  0  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,425

## ITERATION 147 #######################


> Neighbours evaluated; 71
> Selected Move:	5950	4	15	8	23600


> New Y[]: 
	
	 2  0  4  0  0  0  1  0  3  0  1  0  0  0  0  1  0  1  0  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,43

## ITERATION 148 #######################


> Neighbours evaluated; 89
> Selected Move:	5940	3	8	11	23100


> New Y[]: 
	
	 2  0  4  0  0  0  1  0  0  0  1  3  0  0  0  1  0  1  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,435

## ITERATION 149 #######################


> Neighbours evaluated; 80
> Selected Move:	5940	4	11	10	23500


> New Y[]: 
	
	 2  0  4  0  0  0  1  0  0  0  3  1  0  0  0  1  0  1  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,43

## ITERATION 150 #######################


> Neighbours evaluated; 69
> Selected Move:	5940	4	10	15	23700


> New Y[]: 
	
	 2  0  4  0  0  0  1  0  0  0  1  1  0  0  0  3  0  1  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,425

## ITERATION 151 #######################


> Neighbours evaluated; 84
> Selected Move:	5940	3	15	8	24100


> New Y[]: 
	
	 2  0  4  0  0  0  1  0  3  0  1  1  0  0  0  0  0  1  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,42

## ITERATION 152 #######################


> Neighbours evaluated; 74
> Selected Move:	5940	4	8	11	23600


> New Y[]: 
	
	 2  0  4  0  0  0  1  0  1  0  1  3  0  0  0  0  0  1  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,415

## ITERATION 153 #######################


> Neighbours evaluated; 87
> Selected Move:	5900	3	8	4	24100


> New Y[]: 
	
	 2  0  4  0  1  0  1  0  0  0  1  3  0  0  0  0  0  1  0  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,41

## ITERATION 154 #######################


> Neighbours evaluated; 70
> Selected Move:	5900	4	11	4	23800


> New Y[]: 
	
	 2  0  4  0  3  0  1  0  0  0  1  1  0  0  0  0  0  1  0  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,405

## ITERATION 155 #######################


> Neighbours evaluated; 73
> Selected Move:	5900	4	4	17	23500


> New Y[]: 
	
	 2  0  4  0  1  0  1  0  0  0  1  1  0  0  0  0  0  3  0  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,4

## ITERATION 156 #######################


> Neighbours evaluated; 87
> Selected Move:	5900	3	11	15	23000


> New Y[]: 
	
	 2  0  4  0  1  0  1  0  0  0  1  0  0  0  0  1  0  3  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,395

## ITERATION 157 #######################


> Neighbours evaluated; 80
> Selected Move:	5900	4	17	4	23300


> New Y[]: 
	
	 2  0  4  0  3  0  1  0  0  0  1  0  0  0  0  1  0  1  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,39

## ITERATION 158 #######################


> Neighbours evaluated; 72
> Selected Move:	5900	4	4	10	24000


> New Y[]: 
	
	 2  0  4  0  1  0  1  0  0  0  3  0  0  0  0  1  0  1  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,385

## ITERATION 159 #######################


> Neighbours evaluated; 65
> Selected Move:	5900	4	10	15	24200


> New Y[]: 
	
	 2  0  4  0  1  0  1  0  0  0  1  0  0  0  0  3  0  1  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,38

## ITERATION 160 #######################


> Neighbours evaluated; 69
> Selected Move:	5850	3	10	11	24200


> New Y[]: 
	
	 2  0  4  0  1  0  1  0  0  0  0  1  0  0  0  3  0  1  0  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,375

## ITERATION 161 #######################


> Neighbours evaluated; 72
> Selected Move:	5850	4	15	4	23300


> New Y[]: 
	
	 2  0  4  0  3  0  1  0  0  0  0  1  0  0  0  1  0  1  0  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,37

## ITERATION 162 #######################


> Neighbours evaluated; 78
> Selected Move:	5850	4	4	11	23600


> New Y[]: 
	
	 2  0  4  0  1  0  1  0  0  0  0  3  0  0  0  1  0  1  0  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,365

## ITERATION 163 #######################


> Neighbours evaluated; 75
> Selected Move:	5869	1	-1	16	28100


> New Y[]: 
	
	 2  0  4  0  1  0  1  0  0  0  0  3  0  0  0  1  1  1  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,36

## ITERATION 164 #######################


> Neighbours evaluated; 62
> Selected Move:	5874	3	4	5	27600


> New Y[]: 
	
	 2  0  4  0  0  1  1  0  0  0  0  3  0  0  0  1  1  1  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,355

## ITERATION 165 #######################


> Neighbours evaluated; 72
> Selected Move:	5855	3	17	4	27100


> New Y[]: 
	
	 2  0  4  0  1  1  1  0  0  0  0  3  0  0  0  1  1  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,35

## ITERATION 166 #######################


> Neighbours evaluated; 74
> Selected Move:	5895	3	11	17	27500


> New Y[]: 
	
	 2  0  4  0  1  1  1  0  0  0  0  0  0  0  0  1  1  3  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,345

## ITERATION 167 #######################


> Neighbours evaluated; 62
> Selected Move:	5835	3	4	13	28000


> New Y[]: 
	
	 2  0  4  0  0  1  1  0  0  0  0  0  0  1  0  1  1  3  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,35

## ITERATION 168 #######################


> Neighbours evaluated; 61
> Selected Move:	5840	3	17	11	27600


> New Y[]: 
	
	 2  0  4  0  0  1  1  0  0  0  0  3  0  1  0  1  1  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,355

## ITERATION 169 #######################


> Neighbours evaluated; 70
> Selected Move:	5822	3	5	17	28600


> New Y[]: 
	
	 2  0  4  0  0  0  1  0  0  0  0  3  0  1  0  1  1  1  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,36

## ITERATION 170 #######################


> Neighbours evaluated; 60
> Selected Move:	5804	3	13	14	26100


> New Y[]: 
	
	 2  0  4  0  0  0  1  0  0  0  0  3  0  0  1  1  1  1  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,365

## ITERATION 171 #######################


> Neighbours evaluated; 72
> Selected Move:	5774	3	17	9	25100


> New Y[]: 
	
	 2  0  4  0  0  0  1  0  0  1  0  3  0  0  1  1  1  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0 
 > pw :0,37

## ITERATION 172 #######################


> Neighbours evaluated; 94
> Selected Move:	5983	3	16	8	26100


> New Y[]: 
	
	 2  0  4  0  0  0  1  0  1  1  0  3  0  0  1  1  0  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0 
 > pw :0,375

## ITERATION 173 #######################


> Neighbours evaluated; 85
> Selected Move:	5978	3	9	5	26100


> New Y[]: 
	
	 2  0  4  0  0  1  1  0  1  0  0  3  0  0  1  1  0  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0 
 > pw :0,38

## ITERATION 174 #######################


> Neighbours evaluated; 76
> Selected Move:	5952	3	5	10	26100


> New Y[]: 
	
	 2  0  4  0  0  0  1  0  1  0  1  3  0  0  1  1  0  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0 
 > pw :0,385

## ITERATION 175 #######################


> Neighbours evaluated; 93
> Selected Move:	5850	3	11	1	24500


> New Y[]: 
	
	 2  3  4  0  0  0  1  0  1  0  1  0  0  0  1  1  0  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,39

## ITERATION 176 #######################


> Neighbours evaluated; 103
> Selected Move:	6250	3	14	11	26000


> New Y[]: 
	
	 2  3  4  0  0  0  1  0  1  0  1  1  0  0  0  1  0  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0 
 > pw :0,395

## ITERATION 177 #######################


> Neighbours evaluated; 82
> Selected Move:	6185	3	10	9	26000


> New Y[]: 
	
	 2  3  4  0  0  0  1  0  1  1  0  1  0  0  0  1  0  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0 
 > pw :0,4

## ITERATION 178 #######################


> Neighbours evaluated; 94
> Selected Move:	6080	3	8	16	25000


> New Y[]: 
	
	 2  3  4  0  0  0  1  0  0  1  0  1  0  0  0  1  1  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0 
 > pw :0,405

## ITERATION 179 #######################


> Neighbours evaluated; 100
> Selected Move:	6080	3	11	8	25000


> New Y[]: 
	
	 2  3  4  0  0  0  1  0  1  1  0  0  0  0  0  1  1  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,41

## ITERATION 180 #######################


> Neighbours evaluated; 102
> Selected Move:	6080	3	9	7	26000


> New Y[]: 
	
	 2  3  4  0  0  0  1  1  1  0  0  0  0  0  0  1  1  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0 
 > pw :0,415

## ITERATION 181 #######################


> Neighbours evaluated; 79
> Selected Move:	5920	3	7	14	23500


> New Y[]: 
	
	 2  3  4  0  0  0  1  0  1  0  0  0  0  0  1  1  1  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,42

## ITERATION 182 #######################


> Neighbours evaluated; 79
> Selected Move:	6160	3	0	11	26000


> New Y[]: 
	
	 0  3  4  0  0  0  1  0  1  0  0  2  0  0  1  1  1  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0 
 > pw :0,425

## ITERATION 183 #######################


> Neighbours evaluated; 46
> Selected Move:	6495	4	11	8	25200


> New Y[]: 
	
	 0  3  4  0  0  0  1  0  2  0  0  1  0  0  1  1  1  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0 
 > pw :0,43

## ITERATION 184 #######################


> Neighbours evaluated; 76
> Selected Move:	6314	3	11	5	25200


> New Y[]: 
	
	 0  3  4  0  0  1  1  0  2  0  0  0  0  0  1  1  1  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,435

## ITERATION 185 #######################


> Neighbours evaluated; 60
> Selected Move:	6139	4	8	5	25600


> New Y[]: 
	
	 0  3  4  0  0  2  1  0  1  0  0  0  0  0  1  1  1  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,44

## ITERATION 186 #######################


> Neighbours evaluated; 54
> Selected Move:	6136	3	8	11	25600


> New Y[]: 
	
	 0  3  4  0  0  2  1  0  0  0  0  1  0  0  1  1  1  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0 
 > pw :0,445

## ITERATION 187 #######################


> Neighbours evaluated; 44
> Selected Move:	6279	3	5	4	25700


> New Y[]: 
	
	 0  3  4  0  2  0  1  0  0  0  0  1  0  0  1  1  1  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0 
 > pw :0,45

## ITERATION 188 #######################


> Neighbours evaluated; 61
> Selected Move:	6250	3	4	13	26000


> New Y[]: 
	
	 0  3  4  0  0  0  1  0  0  0  0  1  0  2  1  1  1  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,455

## ITERATION 189 #######################


> Neighbours evaluated; 73
> Selected Move:	6115	3	13	18	25100


> New Y[]: 
	
	 0  3  4  0  0  0  1  0  0  0  0  1  0  0  1  1  1  0  2  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0 
 > pw :0,46

## ITERATION 190 #######################


> Neighbours evaluated; 96
> Selected Move:	6114	3	11	8	25100


> New Y[]: 
	
	 0  3  4  0  0  0  1  0  1  0  0  0  0  0  1  1  1  0  2  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,465

## ITERATION 191 #######################


> Neighbours evaluated; 91
> Selected Move:	6098	3	18	7	25800


> New Y[]: 
	
	 0  3  4  0  0  0  1  2  1  0  0  0  0  0  1  1  1  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,47

## ITERATION 192 #######################


> Neighbours evaluated; 62
> Selected Move:	5925	3	7	17	25500


> New Y[]: 
	
	 0  3  4  0  0  0  1  0  1  0  0  0  0  0  1  1  1  2  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,475

## ITERATION 193 #######################


> Neighbours evaluated; 79
> Selected Move:	5862	3	8	11	25500


> New Y[]: 
	
	 0  3  4  0  0  0  1  0  0  0  0  1  0  0  1  1  1  2  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,48

## ITERATION 194 #######################


> Neighbours evaluated; 82
> Selected Move:	5920	3	17	0	23500


> New Y[]: 
	
	 2  3  4  0  0  0  1  0  0  0  0  1  0  0  1  1  1  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0 
 > pw :0,485

## ITERATION 195 #######################


> Neighbours evaluated; 81
> Selected Move:	6060	3	16	4	25000


> New Y[]: 
	
	 2  3  4  0  1  0  1  0  0  0  0  1  0  0  1  1  0  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0 
 > pw :0,49

## ITERATION 196 #######################


> Neighbours evaluated; 78
> Selected Move:	6050	3	4	8	24500


> New Y[]: 
	
	 2  3  4  0  0  0  1  0  1  0  0  1  0  0  1  1  0  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0 
 > pw :0,495

## ITERATION 197 #######################


> Neighbours evaluated; 94
> Selected Move:	5992	3	6	10	25500


> New Y[]: 
	
	 2  3  4  0  0  0  0  0  1  0  1  1  0  0  1  1  0  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 198 #######################


> Neighbours evaluated; 100
> Selected Move:	5980	2	14	-1	21500


> New Y[]: 
	
	 2  3  4  0  0  0  0  0  1  0  1  1  0  0  0  1  0  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,505

## ITERATION 199 #######################


> Neighbours evaluated; 101
> Selected Move:	5960	3	8	4	22000


> New Y[]: 
	
	 2  3  4  0  1  0  0  0  0  0  1  1  0  0  0  1  0  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,51

## ITERATION 200 #######################


> Neighbours evaluated; 97
> Selected Move:	5930	3	10	16	21000


> New Y[]: 
	
	 2  3  4  0  1  0  0  0  0  0  0  1  0  0  0  1  1  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,505

## ITERATION 201 #######################


> Neighbours evaluated; 90
> Selected Move:	5950	3	4	8	20500


> New Y[]: 
	
	 2  3  4  0  0  0  0  0  1  0  0  1  0  0  0  1  1  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 202 #######################


> Neighbours evaluated; 94
> Selected Move:	5830	3	0	6	23000


> New Y[]: 
	
	 0  3  4  0  0  0  2  0  1  0  0  1  0  0  0  1  1  0  0  0 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,495

## ITERATION 203 #######################


> Neighbours evaluated; 76
> Selected Move:	5960	3	8	13	24000


> New Y[]: 
	
	 0  3  4  0  0  0  2  0  0  0  0  1  0  1  0  1  1  0  0  0 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,49

## ITERATION 204 #######################


> Neighbours evaluated; 64
> Selected Move:	5960	4	6	11	23000


> New Y[]: 
	
	 0  3  4  0  0  0  1  0  0  0  0  2  0  1  0  1  1  0  0  0 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,485

## ITERATION 205 #######################


> Neighbours evaluated; 75
> Selected Move:	5960	4	11	13	22000


> New Y[]: 
	
	 0  3  4  0  0  0  1  0  0  0  0  1  0  2  0  1  1  0  0  0 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,48

## ITERATION 206 #######################


> Neighbours evaluated; 78
> Selected Move:	5960	4	13	15	23300


> New Y[]: 
	
	 0  3  4  0  0  0  1  0  0  0  0  1  0  1  0  2  1  0  0  0 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,475
________________________________________________________________

Best solution found: 6710
Run Termination time: 31.01.2010 12:23:34
Run duration: 00:03:31.9218750
________________________________________________________________
